A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
نویسندگان
چکیده
Given a graph G, a designated vertex r and a natural number k, we wish to find k “independent” spanning trees ofG rooted at r, that is, k spanning trees such that, for any vertex v, the k paths connecting r and v in the k trees are internally disjoint in G. In this paper we give a linear-time algorithm to find k independent spanning trees in a k-connected maximal planar graph rooted at any designated vertex. key words: graph, algorithm, independent spanning trees
منابع مشابه
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
Given a graph G, a designated vertex r and a natural number k, we wish to find k “independent” spanning trees of G rooted at r, that is, k spanning trees such that, for any vertex v, the k paths connecting r and v in the k trees are internally disjoint in G. In this paper we give a linear-time algorithm to find four independent spanning trees in a 4-connected planar graph rooted at any vertex.
متن کاملOrderly Spanning Trees with Applications
We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning ...
متن کاملMinimum Spanning Trees for Minor-Closed Graph Classes in Parallel
For each minor-closed graph class we show that a simple variant of Borůvka’s algorithm computes a MST for any input graph belonging to that class with linear costs. Among minor-closed graph classes are e.g planar graphs, graphs of bounded genus, partial k-trees for fixed k, and linkless or knotless embedable graphs. The algorithm can be implemented on a CRCW PRAM to run in logarithmic time with...
متن کامل2 J ul 2 00 1 Orderly Spanning Trees with Applications ∗ Hsueh -
We introduce and study the orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of a plane graph H of G, and an orderly spanning tree of H. We also...
متن کاملMinimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
We present a linear time algorithm exactly solving the 2-edge connected spanning subgraph (2-ECSS) problem in a graph of bounded treewidth. Using this with Klein’s diameter reduction technique [15], we find a linear time PTAS for the problem in unweighted planar graphs, and the first PTAS for the problem in weighted planar graphs.
متن کامل